Avoiding vincular patterns on alternating words

نویسندگان

  • Alice L. L. Gao
  • Sergey Kitaev
  • Philip B. Zhang
چکیده

However, not much was understood on the structure of 123-avoiding up-down words. In this paper, we fill in this gap by introducing the notion of a cut-pair that allows us to subdivide the set of words in question into equivalence classes. We provide a combinatorial argument to show that the number of equivalence classes is given by the Catalan numbers, which induces an alternative (combinatorial) proof of the corresponding result in [3].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Words with Laguerre Series

We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of weighted sums of Laguerre polynomials with parameter α = −1. We describe how such a series can be computed by finding an appropriate ordinary generating function and applying a certain transformation. We use this technique to find the generating function for the numb...

متن کامل

Some Wilf-equivalences for Vincular Patterns

We prove several Wilf-equivalences for vincular patterns of length 4, some of which generalize to infinite families of vincular patterns. We also present functional equations for the generating functions for the number of permutations of length n avoiding σ for the patterns 124-3, 134-2, 231-4, 241-3, 132-4, and 142-3. This nearly completes the Wilfclassification of vincular patterns of length ...

متن کامل

The equidistribution of some vincular patterns on 132-avoiding permutations

A pattern in a permutation π is a sub-permutation of π, and this paper deals mainly with length three patterns. In 2012 Bóna showed the rather surprising fact that the cumulative number of occurrences of the patterns 231 and 213 are the same on the set of permutations avoiding 132, even though the pattern based statistics 231 and 213 do not have the same distribution on this set. Here we show t...

متن کامل

Counting words with Laguerre polynomials

We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of formal sums of Laguerre polynomials. We use this method to find the generating function for k-ary words avoiding any vincular pattern that has only ones. We also give generating functions for k-ary words cyclically avoiding vincular patterns with only ones whose runs...

متن کامل

The equidistribution of some length three vincular patterns on $S_n(132)$

In 2012 Bóna showed the rather surprising fact that the cumulative number of occurrences of the classical patterns 231 and 213 are the same on the set of permutations avoiding 132, beside the pattern based statistics 231 and 213 do not have the same distribution on this set. Here we show that if it is required for the symbols playing the role of 1 and 3 in the occurrences of 231 and 213 to be a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 339  شماره 

صفحات  -

تاریخ انتشار 2016